code-breaking algorithm

См. также в других словарях:

• Code bloat — is the production of code that is perceived as unnecessarily long, slow, or otherwise wasteful of resources. Code bloat can be caused by inadequacies in the language in which the code is written, inadequacies in the compiler used to compile the… …   Wikipedia

• Divide and conquer algorithm — In computer science, divide and conquer (D C) is an important algorithm design paradigm based on multi branched recursion. A divide and conquer algorithm works by recursively breaking down a problem into two or more sub problems of the same (or… …   Wikipedia

• Knuth–Morris–Pratt algorithm — The Knuth–Morris–Pratt string searching algorithm (or KMP algorithm) searches for occurrences of a word W within a main text string S by employing the observation that when a mismatch occurs, the word itself embodies sufficient information to… …   Wikipedia

• Tornado code — In computer science, tornado codes are a class of erasure codes that support error correction and have fast encoding and decoding algorithms. Software based implementations of tornado codes are about 100 times faster on small lengths and about 10 …   Wikipedia

• Hyphenation algorithm — A hyphenation algorithm is a set of rules (especially one codified for implemention in a computer program) that decides at which points a word can be broken over two lines with a hyphen. For example, a hyphenation algorithm might decide that… …   Wikipedia

• алгоритм вскрытия кода — — [http://www.rfcmd.ru/glossword/1.8/index.php?a=index d=23] Тематики защита информации EN code breaking algorithm …   Справочник технического переводчика

• TeX — infobox software name = TeX developer = Donald Knuth latest release version = 3.1415926 latest release date = March 2008 operating system = Cross platform genre = Typesetting license = Permissive website = http://www.tug.org/TeX (pronEng|ˈtɛx, as …   Wikipedia

• Cryptanalysis — Close up of the rotors in a Fialka cipher machine Cryptanalysis (from the Greek kryptós, hidden , and analýein, to loosen or to untie ) is the study of methods for obtaining the meaning of encrypted information, without access to the secret… …   Wikipedia

• Mapping of Unicode characters — Unicode’s Universal Character Set has a potential capacity to support over 1 million characters. Each UCS character is mapped to a code point which is an integer between 0 and 1,114,111 used to represent each character within the internal logic… …   Wikipedia

• Word wrap — or line wrap is the feature, supported by most text editors, word processors, and web browsers, of automatically replacing some of the blank spaces between words by line breaks, such that each line fits in the viewable window, allowing text to be …   Wikipedia

• Data Encryption Standard — The Feistel function (F function) of DES General Designers IBM First publis …   Wikipedia